Efficient algorithms for reconfiguration in VLSI/WSI arrays

Efficient Algorithms for Reconfiguration in VLSI/WSI Arrays

Abstmct-This paper deals with the issue of developing efficient algorithms for reconfiguring processor arrays in the presence of faulty processors and fixed hardware resources. The models discussed in this paper consist of a set of identical processors embedded in a flexible interconnection structure that is configured in the form of a mtangular grid. We first consider an array grid model based...

Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays

-In this paper we consider the problem of reconfiguring processor arrays subject to computational loads that alternate between two modes. A strict mode is characterized by a heavy computational load and severe constraints on response time while a relaxed mode is characterized by a relatively light computational load and relaxed constraints on response time. In the strict mode, reconfiguration i...

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

Efficient Graph Algorithms Using Lazy Monolithic Arrays

Efficient Subspace Fitting Algorithms for Diversely Polarized Arrays

Diversely polarized antenna arrays are widely used in RF applications. The diverrity of rerponse provided b y such arrays can greatly improve direction finding performance over arrays sensitive to only one polarixation component. For d emitterr, direct implementation of a multidimensional estimation algorithm (e.g., maximum likelihood) requires a search f o r 3d parameters: d directions of arri...